Geffert, Viliam: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(log log n)

GEFFERT, VILIAM, PARDUBSKÁ, DANA

Journal:

International Journal of Foundations of Computer Science

Year:

2013

Language:

english

File:

PDF, 264 KB

english, 2013

2

[Lecture Notes in Computer Science] SOFSEM 2014: Theory and Practice of Computer Science Volume 8327 || Goal-Based Establishment of an Information Security Management System Compliant to ISO 27001

Geffert, Viliam, Preneel, Bart, Rovan, Branislav, Štuller, Július, Tjoa, A Min

Year:

2014

Language:

english

File:

PDF, 607 KB

english, 2014

3

Space hierarchy theorem revised

Journal:

Theoretical Computer Science

Year:

2003

Language:

english

File:

PDF, 173 KB

english, 2003

4

Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)

Geffert, Viliam

Journal:

Theory of Computing Systems

Year:

2018

Language:

english

File:

PDF, 1.12 MB

english, 2018

5

A representation of recursively enumerable languages by two homomorphisms and a quotient

Journal:

Theoretical Computer Science

Year:

1988

Language:

english

File:

PDF, 1.32 MB

english, 1988

6

[Lecture Notes in Computer Science] SOFSEM 2014: Theory and Practice of Computer Science Volume 8327 || DSL Based Platform for Business Process Management

Geffert, Viliam, Preneel, Bart, Rovan, Branislav, Štuller, Július, Tjoa, A Min

Year:

2014

Language:

english

File:

PDF, 256 KB

english, 2014

7

A communication hierarchy of parallel computations

Journal:

Theoretical Computer Science

Year:

1998

Language:

english

File:

PDF, 2.42 MB

english, 1998

8

Sublogarithmic Bounds on Space and Reversals

Geffert, Viliam, Mereghetti, Carlo, Pighizzini, Giovanni

Journal:

SIAM Journal on Computing

Year:

1998

Language:

english

File:

PDF, 316 KB

english, 1998

9

[Lecture Notes in Computer Science] SOFSEM 2014: Theory and Practice of Computer Science Volume 8327 || Ordered Restarting Automata for Picture Languages

Geffert, Viliam, Preneel, Bart, Rovan, Branislav, Štuller, Július, Tjoa, A Min

Year:

2014

Language:

english

File:

PDF, 241 KB

english, 2014

10

Two-way automata making choices only at the endmarkers

Geffert, Viliam, Guillon, Bruno, Pighizzini, Giovanni

Journal:

Information and Computation

Year:

2014

Language:

english

File:

PDF, 561 KB

english, 2014

11

A lower bound for the nondeterministic space complexity of context-free recognition

Helmut Alt, Viliam Geffert, Kurt Mehlhorn

Journal:

Information Processing Letters

Year:

1992

Language:

english

File:

PDF, 241 KB

english, 1992

12

Asymptotically efficient in-place merging

Viliam Geffert, Jyrki Katajainen, Tomi Pasanen

Journal:

Theoretical Computer Science

Year:

2000

Language:

english

File:

PDF, 184 KB

english, 2000

13

Converting two-way nondeterministic unary automata into simpler automata

Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini

Journal:

Theoretical Computer Science

Year:

2003

Language:

english

File:

PDF, 175 KB

english, 2003

14

More concise representation of regular languages by automata and regular expressions

Viliam Geffert, Carlo Mereghetti, Beatrice Palano

Journal:

Information and Computation

Year:

2010

Language:

english

File:

PDF, 197 KB

english, 2010

15

Boolean language operations on nondeterministic automata with a pushdown of constant height

Bednárová, Zuzana, Geffert, Viliam, Mereghetti, Carlo, Palano, Beatrice

Journal:

Journal of Computer and System Sciences

Year:

2017

Language:

english

File:

PDF, 780 KB

english, 2017

16

[Lecture Notes in Computer Science] SOFSEM 2008: Theory and Practice of Computer Science Volume 4910 || Algorithmic Problems for Metrics on Permutation Groups

Geffert, Viliam, Karhumäki, Juhani, Bertoni, Alberto, Preneel, Bart, Návrat, Pavol, Bieliková, Mária

Year:

2008

Language:

english

File:

PDF, 511 KB

english, 2008

17

A speed-up theorem without tape compression

Journal:

Theoretical Computer Science

Year:

1993

Language:

english

File:

PDF, 1.12 MB

english, 1993

18

Pairs of Complementary Unary Languages with

Viliam Geffert, Giovanni Pighizzini

Journal:

Year:

2012

Language:

english

File:

PDF, 573 KB

english, 2012

19

Hyper-minimizing minimized deterministic finite state automata

Badr, Andrew, Geffert, Viliam, Shipman, Ian

Journal:

RAIRO - Theoretical Informatics and Applications

Year:

2009

Language:

english

File:

PDF, 323 KB

english, 2009

20

Translation of binary regular expressions into nondeterministic ε-free automata with O(n log n) transitions

Journal:

Journal of Computer and System Sciences

Year:

2003

Language:

english

File:

PDF, 281 KB

english, 2003

21

Two double-exponential gaps for automata with a limited pushdown

Bednárová, Zuzana, Geffert, Viliam

Journal:

Information and Computation

Year:

2016

Language:

english

File:

PDF, 1.41 MB

english, 2016

22

Removing nondeterminism in constant height pushdown automata

Bednárová, Zuzana, Geffert, Viliam, Mereghetti, Carlo, Palano, Beatrice

Journal:

Information and Computation

Year:

2014

Language:

english

File:

PDF, 657 KB

english, 2014

23

Papers published in spectrochimica acta part A, vol. 30A, no. 3

Bednárová, Zuzana, Geffert, Viliam, Mereghetti, Carlo, Palano, Beatrice

Journal:

Spectrochimica Acta Part B: Atomic Spectroscopy

Year:

1974

Language:

english

File:

PDF, 116 KB

english, 1974

24

An in-place sorting with O ( n log n ) comparisons and O ( n ) moves

Franceschini, Gianni, Geffert, Viliam

Journal:

Journal of the ACM

Year:

2005

Language:

english

File:

PDF, 183 KB

english, 2005

25

Nondeterministic Computations in Sublogarithmic Space and Space Constructibility

Geffert, Viliam

Journal:

SIAM Journal on Computing

Year:

1991

Language:

english

File:

PDF, 1.49 MB

english, 1991

26

Two-way unary automata versus logarithmic space

Viliam Geffert, Giovanni Pighizzini

Journal:

Information and Computation

Year:

2011

Language:

english

File:

PDF, 193 KB

english, 2011

27

An alternating hierarchy for finite automata

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 438 KB

english, 2012

28

Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space

Geffert, Viliam

Journal:

SIAM Journal on Computing

Year:

1993

Language:

english

File:

PDF, 1.55 MB

english, 1993

29

Conversion of regular expressions into realtime automata

Geffert, Viliam, Ištoňová, L'ubomíra

Journal:

RAIRO - Theoretical Informatics and Applications

Year:

2006

Language:

english

File:

PDF, 279 KB

english, 2006

30

Multiway in-place merging

Viliam Geffert, Jozef Gajdoš

Journal:

Theoretical Computer Science

Year:

2010

Language:

english

File:

PDF, 642 KB

english, 2010

31

[Lecture Notes in Computer Science] SOFSEM 2014: Theory and Practice of Computer Science Volume 8327 || Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints

Geffert, Viliam, Preneel, Bart, Rovan, Branislav, Štuller, Július, Tjoa, A Min

Year:

2014

Language:

english

File:

PDF, 314 KB

english, 2014

32

New Results on the Minimum Amount of Useful Space

Bednárová, Zuzana, Geffert, Viliam, Reinhardt, Klaus, Yakaryilmaz, Abuzer

Journal:

International Journal of Foundations of Computer Science

Year:

2016

Language:

english

File:

PDF, 321 KB

english, 2016

33

One Pebble Versus Ïµ Â· log n Bits

Geffert, Viliam, Pighizzini, Giovanni, Mereghetti, Carlo

Journal:

Fundamenta Informaticae

Year:

2010

File:

PDF, 128 KB

2010

34

[Lecture Notes in Computer Science] SOFSEM 2014: Theory and Practice of Computer Science Volume 8327 || Aspect-Driven Design of Information Systems

Geffert, Viliam, Preneel, Bart, Rovan, Branislav, Štuller, Július, Tjoa, A Min

Year:

2014

Language:

english

File:

PDF, 267 KB

english, 2014

35

A variant of inductive counting

Journal:

Theoretical Computer Science

Year:

2000

Language:

english

File:

PDF, 100 KB

english, 2000

36

Bridging across the log(n) Space Frontier

Journal:

Information and Computation

Year:

1998

Language:

english

File:

PDF, 542 KB

english, 1998

37

Magic numbers in the state hierarchy of finite automata

Journal:

Information and Computation

Year:

2007

Language:

english

File:

PDF, 359 KB

english, 2007

38

Complementing two-way finite automata

Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini

Journal:

Information and Computation

Year:

2007

Language:

english

File:

PDF, 222 KB

english, 2007

39

[Lecture Notes in Computer Science] SOFSEM 2014: Theory and Practice of Computer Science Volume 8327 || Agile Requirements Engineering: A Research Perspective

Geffert, Viliam, Preneel, Bart, Rovan, Branislav, Štuller, Július, Tjoa, A Min

Year:

2014

Language:

english

File:

PDF, 513 KB

english, 2014

40

Alternating space is closed under complement and other simulations for sublogarithmic space

Geffert, Viliam

Journal:

Information and Computation

Year:

2017

Language:

english

File:

PDF, 589 KB

english, 2017

41

PREFACE

GEFFERT, VILIAM, PIGHIZZINI, GIOVANNI

Journal:

International Journal of Foundations of Computer Science

Year:

2008

Language:

english

File:

PDF, 139 KB

english, 2008

42

The size-cost of Boolean operations on constant height deterministic pushdown automata

Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 963 KB

english, 2012

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски